Quickest online selection of an increasing subsequence of specified size
نویسندگان
چکیده
منابع مشابه
Quickest online selection of an increasing subsequence of specified size
Given a sequence of independent random variables with a common continuous distribution, we consider the online decision problem where one seeks to minimize the expected value of the time that is needed to complete the selection of a monotone increasing subsequence of a prespecified length n. This problem is dual to some online decision problems that have been considered earlier, and this dual p...
متن کاملThe Longest Almost-Increasing Subsequence
Given a sequence of n elements, we introduce the notion of an almost-increasing subsequence as the longest subsequence that can be converted to an increasing subsequence by possibly adding a value, that is at most a fixed constant, to each of the elements. We show how to optimally construct such subsequence in O(n log k) time, where k is the length of the output subsequence.
متن کاملChapter 33 Longest Increasing Subsequence
In this paper we will investigate the connection between random matrices and finding the longest increasing subsequence of a permutation. We will introduce a model for the problem using a simple card game. Then we will talk about Young tableaux and their relation to the symmetric group. Representation theory and power-sum symmetric functions serve as the bridge between this combinatorial constr...
متن کاملevidence of adverse selection in irans health insurance market
در این تحقیق به مطالعه وجود انتخاب نامساعد(کژ گزینی) در بازار بیمه درمان تکمیلی ایران پرداخته شده است. داده های مورد نیاز توسط پرسشنامه و به روش نمونه گیری خوشه ای جمع آوری شده است. پرسشنامه ها در میان افراد شاغل ساکن شهر تهران توریع شد. در این تحقیق با استفاده از تخمین دو مدل لجستیک و به دست آوردن ضریب همبستگی میان تقاضای بیمه درمان تکمیلی و رخداد خسارت به بررسی موضوع مورد نظر پرداخته شده است....
15 صفحه اولThe Size of Subsequence Automaton
Given a set of strings, the subsequence automaton accepts all subsequences of these strings. We derive a lower bound for the maximum number of states of this automaton. We prove that the size of the subsequence automaton for a set of k strings of length n is (nk/(k + 1)kk!) for any k 1. It solves an open problem because only the case k 2 was shown before. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20634